Integrated Natural Language Generation with Schema-Tree Adjoining Grammars
نویسندگان
چکیده
This paper describes an integrated generation system (INLGS) based on the formalism of Schema–Tree Adjoining Grammars with Unification (SU–TAGs). According to this system architecture, all knowledge bases are specified in the same formalism and run the same processing algorithm. A main advantage is that negotiation between generation components can easily be imposed on the system. Moreover, only one algorithm must be implemented and tested in order to provide the one and only processing unit. In our project InTeGenInE, a reversible parser/generator is deployed. It runs knowledge bases in the formalism of Schema–Tree Adjoining Grammars with Unification. SU–TAG comprises a condensed grammar representation and direct parsing deals with partially unspecified schemata. Instead of developing new knowledge bases from scratch, existing ones are reused here. This means all knowledge bases of our INLGS are automatically transformed (e.g., the TAG–based XTAG system and the plan–based interpersonal model of VOTE). The project is funded by the DFG — German Research Foundation — under grant HA 2716/1–1 and 1–2.
منابع مشابه
Negotiation Strategies in an Integrated Natural Language Generation System
This paper describes negotiation strategies in an integrated generation system (INLGS) based on the formalism of Schema–Tree Adjoining Grammars with Unification (SU–TAGs). Integrated or uniformmeans that all knowledge bases are specified in the same formalism and run the same processing algorithm. In our project a reversible parser/generator runs knowledge bases in the formalism of Schema– Tree...
متن کاملParsing with Underspecifications
This paper describes a direct parser for Schema–Tree Adjoining Grammars (S–TAG) which explores schemata, i.e. underspecified elementary rules. Basically, a schema in a S–TAG represents a possibly infinite set of elementary rules by folding up all actual substructures and depicting them in terms of a regular expression (RX). Hence, S–TAGs provide a more condensed grammar representation. In the f...
متن کاملUsing UTAGS for Incremental and Parallel Generation
Exploiting an incremental and parallel processing scheme is useful to improve the performance of natural language generation systems. TAG{GEN is a TAG{based syntactic generator that realizes both principles. It is shown how the demands of incremental and parallel generation innuence the deenition, the design, and the processing of syntactic rules on the basis of Tree Adjoining Grammars.
متن کاملDomain proposal: Sentence generation with tree-adjoining grammars (CRISP)
Overview The CRISP domain is motivated by the problem of sentence generation in natural language generation (NLG).1 NLG is a major subfield of natural language processing, concerned with computing natural language sentences or texts that convey a given piece of information to an audience. In the sentence generation task, we focus on generating a single sentence that expresses a given meaning ac...
متن کامل